CGAL - The Computational Geometry Algorithm Library
نویسنده
چکیده
The Cgal project (www.cgal.org) is a collaborative effort of several research institutes in Europe. The mission of the project is to make the most important of the solutions and methods developed in computational geometry available to users in industry and academia.
منابع مشابه
The CGAL Kernel : A Basis for
A large part of the cgal-project is devoted to the development of a Computational Geometry Algorithms Library, written in C++. We discuss design issues concerning the cgal-kernel which is the basis for the library and hence for all geometric computation in cgal.
متن کاملOn the design of CGAL a computational geometry algorithms library
CGAL is a Computational Geometry Algorithms Library written in C++, which is being developed by research groups in Europe and Israel. The goal is to make the large body of geometric algorithms developed in the field of computational geometry available for industrial application. We discuss the major design goals for CGAL, which are correctness, flexibility, ease-of-use, efficiency, and robustne...
متن کاملTriangulations in CGAL
This paper presents the main algorithmic and design choices that have been made to implement triangulations in the computational geometry algorithms library Cgal.
متن کاملEfficient Computation of Visibility Polygons
Determining visibility in planar polygons and arrangements is an important subroutine for many algorithms in computational geometry. In this paper, we report on new implementations, and corresponding experimental evaluations, for two established and one novel algorithm for computing visibility polygons. These algorithms will be released to the public shortly, as a new package for the Computatio...
متن کاملComputing the width of a point set in 3-space
We present a new algorithm to solve the 3-dimensional width problem, i.e. to determine two parallel planes of smallest distance such that the region between the two planes contains a given point set. Like the algorithm of Houle and Toussaint, our method has quadratic worstcase complexity but is much faster in practice. In contrast to Houle and Toussaint, we do not use plane sweep or point locat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001